Efficient Mechanism Design for Online Scheduling
نویسندگان
چکیده
منابع مشابه
Efficient Mechanism Design for Online Scheduling
This paper concerns the mechanism design for online scheduling in a strategic setting. In this setting, each job is owned by a self-interested agent who may misreport the release time, deadline, length, and value of her job, while we need to determine not only the schedule of the jobs, but also the payment of each agent. We focus on the design of incentive compatible (IC) mechanisms, and study ...
متن کاملEfficient Mechanism Design for Online Scheduling (Extended Abstract)
This work concerns the mechanism design for online scheduling in a strategic setting. In this setting, each job is owned by a self-interested agent who may misreport the release time, deadline, length, and value of her job, while we need to determine not only the schedule of the jobs, but also the payment of each agent. We focus on the design of incentive compatible (IC) mechanisms, and study t...
متن کاملMechanism Design for Decentralized Online Machine Scheduling
Traditional optimization models assume a central decision maker who optimizes a global system performance measure. However, problem data is often distributed among several agents, and agents take autonomous decisions. This gives incentives for strategic behavior of agents, possibly leading to sub-optimal system performance. Furthermore, in dynamic environments, machines are locally dispersed an...
متن کاملApproximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make value-maximizing decisions despite this self-interest. In previous work we presented a Markov decision process (MDP)-based approach to OMD in large-scale problem domains. In practice the underlying MDP needed to solve OMD ...
متن کاملDecentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time – P | rj | ∑ wjCj in the classical notation of [5] – from a new perspective: We assume a strategic setting, where the data of each job, namely its release date rj , its processing time pj and its weight wj is only known to the job itself, but not to the system. Further...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2016
ISSN: 1076-9757
DOI: 10.1613/jair.5100